Computation with Unitaries and One Pure Qubit
نویسنده
چکیده
We define a semantic complexity class based on the model of quantum computing with just one pure qubit (as introduced by Knill & Laflamme) and discuss its computational power in terms of the problem of estimating the trace of a large unitary matrix. We show that this problem is complete for the complexity class, and derive some further fundamental features of the class. We conclude with a discussion of some associated open conjectures and new oracle separations between
منابع مشابه
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
In this paper, we show the equivalence of the set of unitaries computable by the circuits over the Clifford and T library and the set of unitaries over the ring Z[ 1 √ 2 , i], in the single-qubit case. We report an efficient synthesis algorithm, with an exact optimality guarantee on the number of Hadamard and T gates used. We conjecture that the equivalence of the sets of unitaries implementabl...
متن کاملA cold-atoms based processor for deterministic quantum computation with one qubit in intractably large Hilbert spaces
We propose the use of Rydberg interactions and ensembles of cold atoms in mixed state for the implementation of a protocol for deterministic quantum computation with one quantum bit that can be readily operated in high dimensional Hilbert spaces. We propose an experimental test for the scalability of the protocol and to study the physics of discord. Furthermore, we explore the possibility of ex...
متن کاملUniversal quantum computation with ideal Clifford gates and noisy ancillas
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state u0l, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state r, which should be regarded as a parameter of the model. Our goal is to determine for which r universal quantum computatio...
متن کاملOn global effects caused by locally noneffective unitary operations
Given a bipartite quantum state ρ with subsystems A and B of arbitrary dimensions, we study the entanglement detecting capabilities of locally noneffective, or cyclic, unitary operations [L. B. Fu, Europhys. Lett., vol. 75, pp. 1–7, 2006]. Local cyclic unitaries have the special property that they leave their target subsystem invariant. We investigate the distance between ρ and the global state...
متن کاملRepeat-until-success: non-deterministic decomposition of single-qubit unitaries
We present a non-deterministic circuit decomposition technique for approximating an arbitrary single-qubit unitary to within distance that requires significantly fewer non-Clifford gates than deterministic decomposition techniques. We develop “Repeat-Until-Success” (RUS) circuits and characterize unitaries that can be exactly represented as an RUS circuit. Our RUS circuits operate by conditioni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006